- 1 - Routing Methods for Twin - Trailer Trucks by Jonathan
نویسندگان
چکیده
This thesis presents a body of initial work on a class of routing problems that resemble classical vehicle routing problems (VRP's), but differ in a few key aspects. A particular subset of this class arises in the regional-level operation of an LTL (Less than TruckLoad) truck line using twin-trailer combinations. Other problems in the class, covered in much less detail, may be useful in planning regional or overall operations of shipping lines, railroads, barge companies, or air freight carriers. Generally, the orientation of the problem model is towards freight carriers who consolidate siipments into large quanta or containers. This practice is currently widespread as it reduces handling costs. The thesis describes a class of regional LTL twin-trailer truck problems, called the "central 2-CFP", contained in a broader class named k-CFP. It presents an aggregate commodity flow formulation of the k-CFP, and analyzes the formulation's LP relaxation via Lagrangean duality. The next topic is a Lagrangean branch and bound method for the central 2-CFP, including computational tests. The thesis closes by suggesting improvements and alternatives to the tested method. Thesis Supervisor: Yosef Sheffi Title: Associate Professor of Civil Engineering
منابع مشابه
A Tabu Search Approach for Milk Collection in Western Norway Using Trucks and Trailers
Milk collection is a problem which is well known in rural areas all around the world. This paper considers a real world problem for a Norwegian dairy company collecting raw milk from farmers. Chao (2002) and Scheuerer (2006) describe the Truck and Trailer Routing Problem (TTRP) as a variant of the traditional Vehicle Routing Problem (VRP). In this problem customers are divided into vehicle cust...
متن کاملA matheuristic for the truck and trailer routing problem
3 COPA, Department of Industrial Engineering, Universidad de los Andes, Bogota, Colombia {amedagli, nvelasco}@uniandes.edu.co In the truck and trailer problem (TTRP), raised for instance by milk collection in rural areas, a heterogeneous fleet composed of mt trucks and mr trailers (mr < mt) serves a set of customers N = {1, 2, ..., n} from a main depot, denoted as node 0. Each customer i ∈N h...
متن کاملA note on the truck and trailer routing problem
This study considers a relaxation of the truck and trailer routing problem (TTRP), called the relaxed truck and trailer routing problem (RTTRP). In the TTRP, the number of available vehicles, namely trucks and trailers, is limited. Since there are no fixed costs associated with the trucks or trailers, it is reasonable to relax this fleet size constraint. Besides, most benchmark instances for th...
متن کاملBranch-and-Price for the Truck and Trailer Routing Problem with Time Windows
Motivated by a situation faced by infrastructure service providers operating in urban areas with accessibility restrictions, we study the truck and trailer routing problem with time windows (TTRPTW). In this problem the vehicle fleet consists of trucks and trailers which may be decoupled. A set of customers has to be served and some of the customers can only be accessed by the truck without the...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کامل